An Unsupervised Iterative N-Dimensional Point-Set Registration Algorithm
نویسندگان
چکیده
An unsupervised iterative N-dimensional point-set registration algorithm for unlabeled data (i.e., the correspondence between points is unknown) based on linear least squares proposed. The considers all possible point pairings and iteratively aligns two sets until number of pairs does not exceed maximum allowable one-to-one pairings.
منابع مشابه
Affine iterative closest point algorithm for point set registration
Article history: Received 24 April 2009 Received in revised form 15 January 2010 Available online 25 January 2010 Communicated by Y. Liu
متن کاملRigid Registration: The Iterative Closest Point Algorithm
This lecture continues the subject of point based rigid registration. An important aspect of the algorithms previously presented was the assumption that the pairing between point coordinates in the two coordinate systems is known. In this lecture we present an algorithm which will not require this assumption and furthermore does not require a full pairing between data sets. Problem Definition G...
متن کاملN-View Point Set Registration: A Comparison
Recently 3 algorithms for registration of multiple partially overlapping point sets have been published by Pennec [11], Stoddart & Hilton [12] and Benjemma & Schmitt [1]. The problem is of particular interest in the building of surface models from multiple range images taken from several viewpoints. In this paper we perform a comparison of these three algorithms with respect to cpu time, ease o...
متن کاملUnsupervised clustering algorithm for N-dimensional data.
Cluster analysis is an important tool for classifying data. Established techniques include k-means and k-median cluster analysis. However, these methods require the user to provide a priori estimations of the number of clusters and their approximate location in the parameter space. Often these estimations can be made based on some prior understanding about the nature of the data. Alternatively,...
متن کاملEvaluation of a Novel Multiple Point Set Registration Algorithm
We briefly describe a novel solution to the simultaneous multiple view point registration problem and evaluate its performance in a practical machine vision application. The algorithm involves computation of a constant matrix which encodes the point set registration, from which the optimal rigid transformations are found using a simple and efficient iterative algorithm. We describe this algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ukrainian Mathematical Journal
سال: 2022
ISSN: ['0041-5995', '1573-9376']
DOI: https://doi.org/10.1007/s11253-022-02077-3